Free μ - lattices ∗
نویسنده
چکیده
A μ-lattice is a lattice with the property that every unary polynomial has both a least and a greatest fix-point. In this paper we define the quasivariety of μ-lattices and, for a given partially ordered set P , we construct a μ-lattice JP whose elements are equivalence classes of games in a preordered class J (P ). We prove that the μ-lattice JP is free over the ordered set P and that the order relation of JP is decidable if the order relation of P is decidable. By means of this characterization of free μ-lattices we infer that the class of complete lattices generates the quasivariety of μ-lattices.
منابع مشابه
The Alternation Hierarchy for the Theory of Μ-lattices
The alternation hierarchy problem asks whether every μ-term φ, that is, a term built up also using a least fixed point constructor as well as a greatest fixed point constructor, is equivalent to a μ-term where the number of nested fixed points of a different type is bounded by a constant independent of φ. In this paper we give a proof that the alternation hierarchy for the theory of μ-lattices ...
متن کاملCompletions of µ-algebras
A μ-algebra is a model of a first order theory that is an extension of the theory of bounded lattices, that comes with pairs of terms (f, μx.f) where μx.f is axiomatized as the least prefixed point of f , whose axioms are equations or equational implications. Standard μ-algebras are complete meaning that their lattice reduct is a complete lattice. We prove that any non trivial quasivariety of μ...
متن کاملRegularity in residuated lattices
In this paper, we study residuated lattices in order to give new characterizations for dense, regular and Boolean elements in residuated lattices and investigate special residuated lattices in order to obtain new characterizations for the directly indecomposable subvariety of Stonean residuated lattices. Free algebra in varieties of Stonean residuated lattices is constructed. We introduce in re...
متن کاملAmbiguous Classes in the Games µ-Calculus Hierarchy
Every parity game is a combinatorial representation of a closed Boolean μ-term. When interpreted in a distributive lattice every Boolean μ-term is equivalent to a fixed-point free term. The alternationdepth hierarchy is therefore trivial in this case. This is not the case for non distributive lattices, as the second author has shown that the alternation-depth hierarchy is infinite. In this pape...
متن کاملON PROJECTIVE L- MODULES
The concepts of free modules, projective modules, injective modules and the likeform an important area in module theory. The notion of free fuzzy modules was introducedby Muganda as an extension of free modules in the fuzzy context. Zahedi and Ameriintroduced the concept of projective and injective L-modules. In this paper we give analternate definition for projective L-modules. We prove that e...
متن کامل